Relaxations of Weakly Coupled Stochastic Dynamic Programs
نویسندگان
چکیده
We consider a broad class of stochastic dynamic programming problems that are amenable to relaxation via decomposition. These problems comprise multiple subproblems that are independent of each other except for a collection of coupling constraints on the action space. We fit an additively separable value function approximation using two techniques, namely, Lagrangian relaxation and the linear programming (LP) approach to approximate dynamic programming. We prove various results comparing the relaxations to each other and to the optimal problem value. We also provide a column generation algorithm for solving the LP-based relaxation to any desired optimality tolerance, and we report on numerical experiments on bandit-like problems. Our results provide insight into the complexity versus quality trade-off when choosing which of these relaxations to implement.
منابع مشابه
Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
We consider the information relaxation approach for calculating performance bounds for stochastic dynamic programs (DPs). This approach generates performance bounds by solving problems with relaxed nonanticipativity constraints and a penalty that punishes violations of these nonanticipativity constraints. In this paper, we study DPs that have a convex structure and consider gradient penalties t...
متن کاملCoupled fixed point results for weakly related mappings in partially ordered metric spaces
In the present paper, we show the existence of a coupled fixed point for a non-decreasing mapping in partially ordered complete metric space using a partial order induced by an appropriate function $phi$. We also define the concept of weakly related mappings on an ordered space. Moreover common coupled fixed points for two and three weakly related mappings are also proved in the same space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 56 شماره
صفحات -
تاریخ انتشار 2008